Paper 2018/1078

Two Round Information-Theoretic MPC with Malicious Security

Prabhanjan Ananth, Arka Rai Choudhuri, Aarushi Goel, and Abhishek Jain

Abstract

We provide the first constructions of two round information-theoretic (IT) secure multiparty computation (MPC) protocols in the plain model that tolerate any $t<n/2$ malicious corruptions. Our protocols satisfy the strongest achievable standard notions of security in two rounds in different communication models. Previously, IT-MPC protocols in the plain model either required a larger number of rounds, or a smaller minority of corruptions.

Metadata
Available format(s)
PDF
Publication info
Published elsewhere. EUROCRYPT 2019
Keywords
MPCRound-optimalInformation-theoretic
Contact author(s)
aarushig @ cs jhu edu
History
2019-04-26: revised
2018-11-09: received
See all versions
Short URL
https://ia.cr/2018/1078
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2018/1078,
      author = {Prabhanjan Ananth and Arka Rai Choudhuri and Aarushi Goel and Abhishek Jain},
      title = {Two Round Information-Theoretic {MPC} with Malicious Security},
      howpublished = {Cryptology {ePrint} Archive, Paper 2018/1078},
      year = {2018},
      url = {https://eprint.iacr.org/2018/1078}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.